Codes from orbit matrices of strongly regular graphs
نویسندگان
چکیده
منابع مشابه
Binary Codes of Strongly Regular Graphs
For strongly regular graphs with adjacency matrix A, we look at the binary codes generated by A and A+ I . We determine these codes for some families of graphs, we pay attention to the relation between the codes of switching equivalent graphs and, with the exception of two parameter sets, we generate by computer the codes of all known strongly regular graphs on fewer than 45 vertices.
متن کاملGeneration of Strongly Regular Graphs from Normalized Hadamard Matrices
This paper proposes an algorithm which can be used to construct strongly regular graphs from Hadamard matrices.A graph is strongly regular if there are integers and such that every two adjacent vertices have common neighbours and every two non adjacent vertices have common neighbors. Proposed method is mainly based on basic matrix manipulations. If the order of the normalized Hadamard matr ix i...
متن کاملDirected Strongly Regular Graphs and Their Codes
Directed Strongly Regular Graphs (DSRG) were introduced by Duval as a generalization of strongly regular graphs (SRG’s) [4]. As observed in [8] a special case of these are the doubly regular tournaments or equivalently, the skew Hadamard matrices. As the latter already lead to many interesting codes [10] it is natural to consider the more general case of codes constructed from the adjacency mat...
متن کاملHulls of codes from incidence matrices of connected regular graphs
The hulls of codes from the row span over Fp, for any prime p, of incidence matrices of connected k-regular graphs are examined, and the dimension of the hull is given in terms of the dimension of the row span of A+kI over Fp, where A is an adjacency matrix for the graph. If p = 2, for most classes of connected regular graphs with some further form of symmetry, it was shown in [8] that the hull...
متن کاملIdentifying Codes in Vertex-Transitive Graphs and Strongly Regular Graphs
We consider the problem of computing identifying codes of graphs and its fractional relaxation. The ratio between the size of optimal integer and fractional solutions is between 1 and 2 ln(|V |) + 1 where V is the set of vertices of the graph. We focus on vertex-transitive graphs for which we can compute the exact fractional solution. There are known examples of vertex-transitive graphs that re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rad Hrvatske akademije znanosti i umjetnosti Matematičke znanosti
سال: 2018
ISSN: 1845-4100
DOI: 10.21857/mwo1vczo8y